ID2-of-3: Constructive Induction of M -of-N Concepts for Discriminators in Decision Trees

نویسندگان

  • Patrick M. Murphy
  • Michael J. Pazzani
چکیده

We discuss an approach to constructing composite features during the induction of decision trees. The composite features correspond to m-of-n concepts. There are three goals of this research. First, we explore a family of greedy methods for building m-ofn concepts (one of which, GS, is described in this paper). Second, we show how these concepts can be formed as internal nodes of decision trees, serving as a bias to the learner. Finally, we evaluate the method on several arti cially generated and naturally occurring data sets to determine the e ects of this bias.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of Constructive Induction – A Data Mining Technique in Agro Database for Optimal Solution

This research paper is about constructive induction of data mining (DM) which is used to cope with inadequacy of attributes. Constructive induction is a process of learning concept description that represents best hypothesis in the space. Inductive learning algorithms are increasingly being pressed into service, as data mining and knowledge discovery tools, to detect patterns or regularities in...

متن کامل

A Comparison of Constructive Induction withDi erent Types of

This paper studies the eeects on decision tree learning of constructing four types of attribute (conjunctive, disjunctive, M-of-N, and X-of-N representations). To reduce eeects of other factors such as tree learning methods, new attribute search strategies, search starting points, evaluation functions, and stopping criteria, a single tree learning algorithm is developed. With diierent option se...

متن کامل

Comparing different stopping criteria for fuzzy decision tree induction through IDFID3

Fuzzy Decision Tree (FDT) classifiers combine decision trees with approximate reasoning offered by fuzzy representation to deal with language and measurement uncertainties. When a FDT induction algorithm utilizes stopping criteria for early stopping of the tree's growth, threshold values of stopping criteria will control the number of nodes. Finding a proper threshold value for a stopping crite...

متن کامل

CN2-MCI: A Two-Step Method for Constructive Induction

Methods for constructive induction perform an automatic transformation of description spaces if representational shortcomings deteriorate the quality of learning. In the context of concept learning and propositional representation languages, feature construction algorithms have been developed in order to improve the accuracy and to decrease the complexity of hypotheses. Particularly, so-called ...

متن کامل

Constructive Induction of Cartesian Product Attributes

Constructive induction is the process of changing the representation of examples by creating new attributes from existing attributes. In classi cation, the goal of constructive induction is to nd a representation that facilitates learning a concept description by a particular learning system. Typically, the new attributes are Boolean or arithmetic combinations of existing attributes and the lea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991